|
In the mathematical field of graph theory, the Szekeres snark is a snark with 50 vertices and 75 edges. It was the fifth known snark, discovered by George Szekeres in 1973. As a snark, the Szekeres graph is a connected, bridgeless cubic graph with chromatic index equal to 4. The Szekeres snark is non-planar and non-hamiltonian but is hypohamiltonian. Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989.〔Watkins, J. J. "Snarks." Ann. New York Acad. Sci. 576, 606-622, 1989.〕 ==Gallery== Image:Szekeres snark 3COL.svg|The chromatic number of the Szekeres snark is 3. Image:Szekeres snark 4color edge.svg|The chromatic index of the Szekeres snark is 4. Image:Szekeres-snark.svg|Alternative drawing of the Szekeres snark. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Szekeres snark」の詳細全文を読む スポンサード リンク
|